Decomposition of Cyclic Groups

Theorem

Given two cyclic groups $C_{m}$ and $C_{n}$ of order $m$ and $n$ respectively, if $\gcd (m, n) = 1$ then

C_{m} \otimes C_{n} ≅ C_{m n} .

Proof

We will prove that $C_{m} \otimes C_{n}$ is cyclic by showing that for generator $g_{m}$ of $C_{m}$ and $g_{n}$ of $C_{n}$

(g_{m}, g_{n})

is a generator of $C_{m} \otimes C_{n}$ of order $m n$ .

First note that

(g_{m}, g_{n})^{k} = (g_{m}^{k}, g_{n}^{k}) .

and hence we end up with the identity if $m ∣ k$ and $n ∣ k$ .

The smallest possible value which is a multiple of both $m$ and $n$ is their lowest common multiple by definition. However, since $\gcd (m, n) = 1$ , we conclude by this result ( $gcd (m, n) \cdot lcm (m, n) = m n$ ) that

lcm (m, n) = m n .

This then gives us that

ϕ : g^{k} \mapsto (g_{m}^{k}, g_{n}^{k})

is the explicit isomorphism between these groups.

Corollary

If $m$ and $n$ are coprime integers positive integers, then:

Z_{m n} ≅ Z_{m} \oplus Z_{n}

where $\oplus$ gives the direct sum of groups.

This result is also known as the chinese remainder theorem, and follows very easily from the fact that $Z_{m}$ is cyclic of order $m$ , generated by $1$ .

We can also get an explicit isomorphism by means of the group as direct product of subgroups, as shown below, however note that this isomorphism is different to the one given by the chinese remainder theorem, and thus is no replacement for the chinese remainder theorem algorithm.

Proof

The key idea in this alternate proof is identifying that for coprime $m$ and $n$ , we can decompose

Z_{m n} ≅ ⟨ \frac{m n}{m} ⟩ \oplus ⟨ \frac{m n}{n} ⟩ ≅ Z_{n} \oplus Z_{m} .

This is very intuitive with an example:

\begin{array}{r} Z_{15} ≅ ⟨ 3 ⟩ \oplus ⟨ 5 ⟩ . \end{array}

Note that $⟨ 3 ⟩ = {0, 3, 6, 9, 12}$ and has $5$ elements. This is isomorphic to $Z_{5}$ using the isomorphism

a \mapsto 3 a .

Similarly for $⟨ 5 ⟩$ and $Z_{3}$ .

To prove this rigorously, we appeal to this corollary of the internal characterisation of products, and note that coprimality guarantees the trivial intersection (no multiple of $a$ can be a multiple of $b$ unless it is a multiple of $a b$ for coprime $a$ and $b$ ) while the way the groups are chosen means the product of their sizes is equal to the size of the main group.

Crucially though, the isomorphism given from this theorem is different to that of the chinese remainder theorem.

Specifically, if we have

x \equiv 2 (\mod 3) and x \equiv 4 (\mod 5),

this corresponds with $2 \times 5 = 10$ in $⟨ 5 ⟩$ and $4 \times 3 = 12$ in $⟨ 3 ⟩$ , however when we apply the isomorphism back to $Z_{15}$ ,

ϕ ((12, 10)) = 22 (\mod 1) 5 = 7,

we do not get the solution to the original equations. There is automorphism that maps these values back to the desired solutions.

Hence in this case while we have an explicit isomorphism, it's not a particularly useful one.